Dynamic Geometric Graph Processes: Adjacency Operator Approach
نویسندگان
چکیده
The d-dimensional unit cube [0, 1] is discretized to create a collection V of vertices used to define geometric graphs. Each subset of V is uniquely associated with a geometric graph. Defining a dynamic random walk on the subsets of V induces a walk on the collection of geometric graphs in the discretized cube. These walks naturally model addition-deletion networks and can be visualized as walks on hypercubes with loops. Adjacency operators are constructed using subalgebras of Clifford algebras and are used to recover information about the cycle structure and connected components of the n graph of a sequence.
منابع مشابه
Cycles and Components in Geometric Graphs: Adjacency Operator Approach
Nilpotent and idempotent adjacency operator methods are applied to the study of random geometric graphs in a discretized, d-dimensional unit cube [0, 1]. Cycles are enumerated, sizes of maximal connected components are computed, and closed formulas are obtained for graph circumference and girth. Expected numbers of k-cycles, expected sizes of maximal components, and expected circumference and g...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملDynamic isoperimetry and the geometry of Lagrangian coherent structures
The study of transport and mixing processes in dynamical systems is particularly important for the analysis of mathematical models of physical systems. Barriers to transport, which mitigate mixing, describe a skeleton about which possibly turbulent flow evolves. We propose a novel, direct geometric method to identify subsets of phase space that remain strongly coherent over a finite time durati...
متن کاملSpectral Bounds for the Independence Ratio and the Chromatic Number of an Operator
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we give bounds for these parameters in terms of the numerical range of the operator. This provides a theoretical framework in which many packing and coloring proble...
متن کاملEigenvalue comparisons in graph theory
In this paper, we explore what happens when the same techniques are applied to the problem of estimating eigenvalues of the adjacency operator on finite graphs of bounded degree. In Theorem 7, we show how eigenvalues of the adjacency operator on a finite graph Γ may be bounded in terms of the biggest eigenvalues of the adjacency operator on “geodesic balls” in Γ. We find explicit bounds for the...
متن کامل